Minimum Guesswork With an Unreliable Oracle
نویسندگان
چکیده
منابع مشابه
Reducing Guesswork via an Unreliable Oracle
Alice holds an r.v. X, and Bob is trying to guess its value by asking questions of the form “is X = x?”. Alice answers truthfully and the game terminates once Bob guesses correctly. Before the game begins, Bob is allowed to reach out to an oracle, Carole, and ask her any yes/no question, i.e., a question of the form “is X ∈ A?”. Carole is known to lie with a given probability 0 ≤ p ≤ 1/2. What ...
متن کاملMinimum guesswork discrimination between quantum states
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able to use a brute-force strategy to query the state, discrimination measurement with minimum error probability does not necessarily minimize the number of querie...
متن کاملReliable Mapping with an Unreliable Positioning System
We describe mapping of an unknown environment by an artificial agent using a Cognitive Map implemented by a neural network. The environment is depicted in terms of the connectivity between spatial places located on a Cartesian grid. It is shown that the agent can provide a reasonably accurate map even in the absence of a completely reliable positioning system. Spatial Learning with a Cognitive ...
متن کاملMinimum Energy Reliable Paths Using Unreliable Wireless Links
We address the problem of energy-efficient reliable wireless communication in the presence of unreliable or lossy wireless link layers in multi-hop wireless networks. Banerjee and Misra had attempted to address this problem in their prior work [1] but had provided an optimal energy-efficient solution to this problem for the case where link layers implement perfect reliability. However, a more c...
متن کاملLearning with the Aid of an Oracle
Problem For a given class of Boolean functions, such as polynomial-size Boolean circuits or Disjunctive Normal Form ( ? @FA ) formulas, the goal is to design polynomial-time learning algorithms for any unknown I*J and ask a polynomial number of queries. The output of the learning algorithm should be a function of polynomial size satisfying KL M . The polynomial functions bounding the running ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.3033305